0.07/0.13 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.07/0.14 % Command : run_E %s %d THM 0.15/0.36 % Computer : n020.cluster.edu 0.15/0.36 % Model : x86_64 x86_64 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.15/0.36 % Memory : 8042.1875MB 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64 0.15/0.36 % CPULimit : 960 0.15/0.36 % WCLimit : 120 0.15/0.36 % DateTime : Tue Aug 9 06:42:50 EDT 2022 0.15/0.36 % CPUTime : 0.23/0.52 Running higher-order on 8 cores theorem proving 0.23/0.52 Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=120 /export/starexec/sandbox/benchmark/theBenchmark.p 0.23/0.53 # Version: 3.0pre003-ho 0.23/0.56 # Preprocessing class: HSLMSMSSLLLCHSA. 0.23/0.56 # Scheduled 6 strats onto 8 cores with 120 seconds (960 total) 0.23/0.56 # Starting lpo1_fix with 360s (3) cores 0.23/0.56 # Starting full_lambda_9 with 120s (1) cores 0.23/0.56 # Starting almost_fo_4 with 120s (1) cores 0.23/0.56 # Starting new_ho_9 with 120s (1) cores 0.23/0.56 # Starting pre_casc_4 with 120s (1) cores 0.23/0.56 # Starting ho_unfolding_6 with 120s (1) cores 0.23/0.56 # pre_casc_4 with pid 15339 completed with status 0 0.23/0.56 # Result found by pre_casc_4 0.23/0.56 # Preprocessing class: HSLMSMSSLLLCHSA. 0.23/0.56 # Scheduled 6 strats onto 8 cores with 120 seconds (960 total) 0.23/0.56 # Starting lpo1_fix with 360s (3) cores 0.23/0.56 # Starting full_lambda_9 with 120s (1) cores 0.23/0.56 # Starting almost_fo_4 with 120s (1) cores 0.23/0.56 # Starting new_ho_9 with 120s (1) cores 0.23/0.56 # Starting pre_casc_4 with 120s (1) cores 0.23/0.56 # SinE strategy is GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true) 0.23/0.56 # ...ProofStateSinE()=70/314 0.23/0.56 # Search class: HGUSM-FFMM31-DHSMMSBN 0.23/0.56 # partial match(3): HGHSM-FFMM31-SHSSMSBN 0.23/0.56 # Scheduled 6 strats onto 1 cores with 120 seconds (120 total) 0.23/0.56 # Starting new_ho_10 with 65s (1) cores 0.23/0.56 # new_ho_10 with pid 15341 completed with status 0 0.23/0.56 # Result found by new_ho_10 0.23/0.56 # Preprocessing class: HSLMSMSSLLLCHSA. 0.23/0.56 # Scheduled 6 strats onto 8 cores with 120 seconds (960 total) 0.23/0.56 # Starting lpo1_fix with 360s (3) cores 0.23/0.56 # Starting full_lambda_9 with 120s (1) cores 0.23/0.56 # Starting almost_fo_4 with 120s (1) cores 0.23/0.56 # Starting new_ho_9 with 120s (1) cores 0.23/0.56 # Starting pre_casc_4 with 120s (1) cores 0.23/0.56 # SinE strategy is GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true) 0.23/0.56 # ...ProofStateSinE()=70/314 0.23/0.56 # Search class: HGUSM-FFMM31-DHSMMSBN 0.23/0.56 # partial match(3): HGHSM-FFMM31-SHSSMSBN 0.23/0.56 # Scheduled 6 strats onto 1 cores with 120 seconds (120 total) 0.23/0.56 # Starting new_ho_10 with 65s (1) cores 0.23/0.56 # Preprocessing time : 0.006 s 0.23/0.56 # Presaturation interreduction done 0.23/0.56 0.23/0.56 # Proof found! 0.23/0.56 # SZS status Theorem 0.23/0.56 # SZS output start CNFRefutation 0.23/0.56 thf(decl_22, type, is_of: $i > ($i > $o) > $o). 0.23/0.56 thf(decl_23, type, all_of: ($i > $o) > ($i > $o) > $o). 0.23/0.56 thf(decl_24, type, eps: ($i > $o) > $i). 0.23/0.56 thf(decl_25, type, in: $i > $i > $o). 0.23/0.56 thf(decl_26, type, d_Subq: $i > $i > $o). 0.23/0.56 thf(decl_27, type, emptyset: $i). 0.23/0.56 thf(decl_28, type, union: $i > $i). 0.23/0.56 thf(decl_29, type, power: $i > $i). 0.23/0.56 thf(decl_30, type, repl: $i > ($i > $i) > $i). 0.23/0.56 thf(decl_31, type, d_Union_closed: $i > $o). 0.23/0.56 thf(decl_32, type, d_Power_closed: $i > $o). 0.23/0.56 thf(decl_33, type, d_Repl_closed: $i > $o). 0.23/0.56 thf(decl_34, type, d_ZF_closed: $i > $o). 0.23/0.56 thf(decl_35, type, univof: $i > $i). 0.23/0.56 thf(decl_36, type, if: $o > $i > $i > $i). 0.23/0.56 thf(decl_37, type, nIn: $i > $i > $o). 0.23/0.56 thf(decl_38, type, d_UPair: $i > $i > $i). 0.23/0.56 thf(decl_39, type, d_Sing: $i > $i). 0.23/0.56 thf(decl_40, type, binunion: $i > $i > $i). 0.23/0.56 thf(decl_41, type, famunion: $i > ($i > $i) > $i). 0.23/0.56 thf(decl_42, type, d_Sep: $i > ($i > $o) > $i). 0.23/0.56 thf(decl_43, type, d_ReplSep: $i > ($i > $o) > ($i > $i) > $i). 0.23/0.56 thf(decl_44, type, setminus: $i > $i > $i). 0.23/0.56 thf(decl_45, type, d_In_rec_G: ($i > ($i > $i) > $i) > $i > $i > $o). 0.23/0.56 thf(decl_46, type, d_In_rec: ($i > ($i > $i) > $i) > $i > $i). 0.23/0.56 thf(decl_47, type, ordsucc: $i > $i). 0.23/0.56 thf(decl_48, type, nat_p: $i > $o). 0.23/0.56 thf(decl_49, type, omega: $i). 0.23/0.56 thf(decl_50, type, d_Inj1: $i > $i). 0.23/0.56 thf(decl_51, type, d_Inj0: $i > $i). 0.23/0.56 thf(decl_52, type, d_Unj: $i > $i). 0.23/0.56 thf(decl_53, type, pair: $i > $i > $i). 0.23/0.56 thf(decl_54, type, proj0: $i > $i). 0.23/0.56 thf(decl_55, type, proj1: $i > $i). 0.23/0.56 thf(decl_56, type, d_Sigma: $i > ($i > $i) > $i). 0.23/0.56 thf(decl_57, type, setprod: $i > $i > $i). 0.23/0.56 thf(decl_58, type, ap: $i > $i > $i). 0.23/0.56 thf(decl_59, type, pair_p: $i > $o). 0.23/0.56 thf(decl_60, type, d_Pi: $i > ($i > $i) > $i). 0.23/0.56 thf(decl_61, type, imp: $o > $o > $o). 0.23/0.56 thf(decl_62, type, d_not: $o > $o). 0.23/0.56 thf(decl_63, type, wel: $o > $o). 0.23/0.56 thf(decl_64, type, obvious: $o). 0.23/0.56 thf(decl_65, type, l_ec: $o > $o > $o). 0.23/0.56 thf(decl_66, type, d_and: $o > $o > $o). 0.23/0.56 thf(decl_67, type, l_or: $o > $o > $o). 0.23/0.56 thf(decl_68, type, orec: $o > $o > $o). 0.23/0.56 thf(decl_69, type, l_iff: $o > $o > $o). 0.23/0.56 thf(decl_70, type, all: $i > ($i > $o) > $o). 0.23/0.56 thf(decl_71, type, non: $i > ($i > $o) > $i > $o). 0.23/0.56 thf(decl_72, type, l_some: $i > ($i > $o) > $o). 0.23/0.56 thf(decl_73, type, or3: $o > $o > $o > $o). 0.23/0.56 thf(decl_74, type, and3: $o > $o > $o > $o). 0.23/0.56 thf(decl_75, type, ec3: $o > $o > $o > $o). 0.23/0.56 thf(decl_76, type, orec3: $o > $o > $o > $o). 0.23/0.56 thf(decl_77, type, e_is: $i > $i > $i > $o). 0.23/0.56 thf(decl_78, type, amone: $i > ($i > $o) > $o). 0.23/0.56 thf(decl_79, type, one: $i > ($i > $o) > $o). 0.23/0.56 thf(decl_80, type, ind: $i > ($i > $o) > $i). 0.23/0.56 thf(decl_81, type, injective: $i > $i > $i > $o). 0.23/0.56 thf(decl_82, type, image: $i > $i > $i > $i > $o). 0.23/0.56 thf(decl_83, type, tofs: $i > $i > $i > $i > $i). 0.23/0.56 thf(decl_84, type, soft: $i > $i > $i > $i > $i). 0.23/0.56 thf(decl_85, type, inverse: $i > $i > $i > $i). 0.23/0.56 thf(decl_86, type, surjective: $i > $i > $i > $o). 0.23/0.56 thf(decl_87, type, bijective: $i > $i > $i > $o). 0.23/0.56 thf(decl_88, type, invf: $i > $i > $i > $i). 0.23/0.56 thf(decl_89, type, inj_h: $i > $i > $i > $i > $i > $i). 0.23/0.56 thf(decl_90, type, e_in: $i > ($i > $o) > $i > $i). 0.23/0.56 thf(decl_91, type, out: $i > ($i > $o) > $i > $i). 0.23/0.56 thf(decl_92, type, d_pair: $i > $i > $i > $i > $i). 0.23/0.56 thf(decl_93, type, first: $i > $i > $i > $i). 0.23/0.56 thf(decl_94, type, second: $i > $i > $i > $i). 0.23/0.56 thf(decl_95, type, prop1: $o > $i > $i > $i > $i > $o). 0.23/0.56 thf(decl_96, type, ite: $o > $i > $i > $i > $i). 0.23/0.56 thf(decl_97, type, wissel_wa: $i > $i > $i > $i > $i). 0.23/0.56 thf(decl_98, type, wissel_wb: $i > $i > $i > $i > $i). 0.23/0.56 thf(decl_99, type, wissel: $i > $i > $i > $i). 0.23/0.56 thf(decl_100, type, changef: $i > $i > $i > $i > $i > $i). 0.23/0.56 thf(decl_101, type, r_ec: $o > $o > $o). 0.23/0.56 thf(decl_102, type, esti: $i > $i > $i > $o). 0.23/0.56 thf(decl_103, type, empty: $i > $i > $o). 0.23/0.56 thf(decl_104, type, nonempty: $i > $i > $o). 0.23/0.56 thf(decl_105, type, incl: $i > $i > $i > $o). 0.23/0.56 thf(decl_106, type, st_disj: $i > $i > $i > $o). 0.23/0.56 thf(decl_107, type, nissetprop: $i > $i > $i > $i > $o). 0.23/0.56 thf(decl_108, type, unmore: $i > $i > $i > $i). 0.23/0.56 thf(decl_109, type, ecelt: $i > ($i > $i > $o) > $i > $i). 0.23/0.56 thf(decl_110, type, ecp: $i > ($i > $i > $o) > $i > $i > $o). 0.23/0.56 thf(decl_111, type, anec: $i > ($i > $i > $o) > $i > $o). 0.23/0.56 thf(decl_112, type, ect: $i > ($i > $i > $o) > $i). 0.23/0.56 thf(decl_113, type, ectset: $i > ($i > $i > $o) > $i > $i). 0.23/0.56 thf(decl_114, type, ectelt: $i > ($i > $i > $o) > $i > $i). 0.23/0.56 thf(decl_115, type, ecect: $i > ($i > $i > $o) > $i > $i). 0.23/0.56 thf(decl_116, type, fixfu: $i > ($i > $i > $o) > $i > $i > $o). 0.23/0.56 thf(decl_117, type, d_10_prop1: $i > ($i > $i > $o) > $i > $i > $i > $i > $i > $o). 0.23/0.56 thf(decl_118, type, prop2: $i > ($i > $i > $o) > $i > $i > $i > $i > $o). 0.23/0.56 thf(decl_119, type, indeq: $i > ($i > $i > $o) > $i > $i > $i > $i). 0.23/0.56 thf(decl_120, type, fixfu2: $i > ($i > $i > $o) > $i > $i > $o). 0.23/0.56 thf(decl_121, type, d_11_i: $i > ($i > $i > $o) > $i > $i > $i > $i). 0.23/0.56 thf(decl_122, type, indeq2: $i > ($i > $i > $o) > $i > $i > $i > $i > $i). 0.23/0.56 thf(decl_123, type, nat: $i). 0.23/0.56 thf(decl_124, type, n_is: $i > $i > $o). 0.23/0.56 thf(decl_125, type, nis: $i > $i > $o). 0.23/0.56 thf(decl_126, type, n_in: $i > $i > $o). 0.23/0.56 thf(decl_127, type, n_some: ($i > $o) > $o). 0.23/0.56 thf(decl_128, type, n_all: ($i > $o) > $o). 0.23/0.56 thf(decl_129, type, n_one: ($i > $o) > $o). 0.23/0.56 thf(decl_130, type, n_1: $i). 0.23/0.56 thf(decl_131, type, cond1: $i > $o). 0.23/0.56 thf(decl_132, type, cond2: $i > $o). 0.23/0.56 thf(decl_133, type, i1_s: ($i > $o) > $i). 0.23/0.56 thf(decl_134, type, d_22_prop1: $i > $o). 0.23/0.56 thf(decl_135, type, d_23_prop1: $i > $o). 0.23/0.56 thf(decl_136, type, d_24_prop1: $i > $o). 0.23/0.56 thf(decl_137, type, d_24_prop2: $i > $i > $o). 0.23/0.56 thf(decl_138, type, prop3: $i > $i > $i > $o). 0.23/0.56 thf(decl_139, type, prop4: $i > $o). 0.23/0.56 thf(decl_140, type, d_24_g: $i > $i). 0.23/0.56 thf(decl_141, type, plus: $i > $i). 0.23/0.56 thf(decl_142, type, n_pl: $i > $i > $i). 0.23/0.56 thf(decl_143, type, esk1_0: $i). 0.23/0.56 thf(decl_144, type, esk2_0: $i). 0.23/0.56 thf(decl_145, type, esk3_1: ($i > $o) > $i). 0.23/0.56 thf(decl_146, type, esk4_2: $i > ($i > $o) > $i). 0.23/0.56 thf(decl_147, type, esk5_2: $i > ($i > $o) > $i). 0.23/0.56 thf(decl_148, type, epred1_1: $i > $i > $o). 0.23/0.56 thf(decl_149, type, esk6_4: $i > $i > $i > $i > $i). 0.23/0.56 thf(decl_150, type, esk7_3: $i > ($i > $i) > ($i > $i) > $i). 0.23/0.56 thf(decl_151, type, esk8_4: $i > ($i > $i) > $i > $i > $i). 0.23/0.56 thf(decl_152, type, esk9_2: $i > $i > $i). 0.23/0.56 thf(decl_153, type, esk10_3: $i > ($i > $i) > $i > $i). 0.23/0.56 thf(decl_154, type, esk11_1: ($i > $o) > $i). 0.23/0.56 thf(decl_155, type, epred2_1: $i > $i > $o). 0.23/0.56 thf(decl_156, type, esk12_2: $i > ($i > $o) > $i). 0.23/0.56 thf(decl_157, type, esk13_1: ($i > $o) > $i). 0.23/0.56 thf(decl_158, type, esk14_2: ($i > $o) > ($i > $o) > $i). 0.23/0.56 thf(decl_159, type, epred3_2: ($i > $o) > $i > $i > $o). 0.23/0.56 thf(decl_160, type, epred4_1: $i > $i > $o). 0.23/0.56 thf(decl_161, type, esk15_1: $i > $i). 0.23/0.56 thf(decl_162, type, esk16_2: $i > ($i > $o) > $i). 0.23/0.56 thf(def_all_of, axiom, ((all_of)=(^[X3:$i > $o, X2:$i > $o]:(![X4:$i]:(((is_of @ X4 @ X3)=>(X2 @ X4)))))), file('/export/starexec/sandbox/benchmark/Axioms/NUM007^0.ax', def_all_of)). 0.23/0.56 thf(def_is_of, axiom, ((is_of)=(^[X1:$i, X2:$i > $o]:((X2 @ X1)))), file('/export/starexec/sandbox/benchmark/Axioms/NUM007^0.ax', def_is_of)). 0.23/0.56 thf(def_e_is, axiom, ((e_is)=(^[X1:$i, X60:$i, X61:$i]:(((X60)=(X61))))), file('/export/starexec/sandbox/benchmark/Axioms/NUM007^0.ax', def_e_is)). 0.23/0.56 thf(def_n_is, axiom, ((n_is)=(^[Z0:$i, Z1:$i]:(((Z0)=(Z1))))), file('/export/starexec/sandbox/benchmark/Axioms/NUM007^0.ax', def_n_is)). 0.23/0.56 thf(satz4h, conjecture, (all_of @ (^[X1:$i]:((in @ X1 @ nat))) @ (^[X1:$i]:((all_of @ (^[X184:$i]:((in @ X184 @ nat))) @ (^[X185:$i]:((n_is @ (ordsucc @ (n_pl @ X1 @ X185)) @ (n_pl @ (ordsucc @ X1) @ X185)))))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', satz4h)). 0.23/0.56 thf(satz4d, axiom, (all_of @ (^[X1:$i]:((in @ X1 @ nat))) @ (^[X1:$i]:((all_of @ (^[X191:$i]:((in @ X191 @ nat))) @ (^[X192:$i]:((n_is @ (n_pl @ (ordsucc @ X1) @ X192) @ (ordsucc @ (n_pl @ X1 @ X192))))))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', satz4d)). 0.23/0.56 thf(c_0_6, plain, ((all_of)=(^[Z0:$i > $o, Z1:$i > $o]:(![X4:$i]:((((Z0 @ X4))=>(Z1 @ X4)))))), inference(fof_simplification,[status(thm)],[def_all_of])). 0.23/0.56 thf(c_0_7, plain, ((is_of)=(^[Z0:$i, Z1:$i > $o]:((Z1 @ Z0)))), inference(fof_simplification,[status(thm)],[def_is_of])). 0.23/0.56 thf(c_0_8, plain, ((e_is)=(^[Z0:$i, Z1:$i, Z2:$i]:(((Z1)=(Z2))))), inference(fof_simplification,[status(thm)],[def_e_is])). 0.23/0.56 thf(c_0_9, plain, ((all_of)=(^[Z0:$i > $o, Z1:$i > $o]:(![X4:$i]:((((Z0 @ X4))=>(Z1 @ X4)))))), inference(apply_def,[status(thm)],[c_0_6, c_0_7])). 0.23/0.56 thf(c_0_10, axiom, ((n_is)=(^[Z0:$i, Z1:$i]:(((Z0)=(Z1))))), inference(apply_def,[status(thm)],[def_n_is, c_0_8])). 0.23/0.56 thf(c_0_11, negated_conjecture, ~(![X282:$i]:(((in @ X282 @ nat)=>![X281:$i]:(((in @ X281 @ nat)=>((ordsucc @ (n_pl @ X282 @ X281))=(n_pl @ (ordsucc @ X282) @ X281))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[satz4h])]), c_0_9]), c_0_10])). 0.23/0.56 thf(c_0_12, plain, ![X294:$i]:(((in @ X294 @ nat)=>![X293:$i]:(((in @ X293 @ nat)=>((n_pl @ (ordsucc @ X294) @ X293)=(ordsucc @ (n_pl @ X294 @ X293))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[satz4d]), c_0_9]), c_0_10])). 0.23/0.56 thf(c_0_13, negated_conjecture, ((in @ esk1_0 @ nat)&((in @ esk2_0 @ nat)&((ordsucc @ (n_pl @ esk1_0 @ esk2_0))!=(n_pl @ (ordsucc @ esk1_0) @ esk2_0)))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])). 0.23/0.56 thf(c_0_14, plain, ![X359:$i, X360:$i]:((~(in @ X359 @ nat)|(~(in @ X360 @ nat)|((n_pl @ (ordsucc @ X359) @ X360)=(ordsucc @ (n_pl @ X359 @ X360)))))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])])). 0.23/0.56 thf(c_0_15, negated_conjecture, ((ordsucc @ (n_pl @ esk1_0 @ esk2_0))!=(n_pl @ (ordsucc @ esk1_0) @ esk2_0)), inference(split_conjunct,[status(thm)],[c_0_13])). 0.23/0.56 thf(c_0_16, plain, ![X1:$i, X4:$i]:((((n_pl @ (ordsucc @ X1) @ X4)=(ordsucc @ (n_pl @ X1 @ X4)))|~((in @ X1 @ nat))|~((in @ X4 @ nat)))), inference(split_conjunct,[status(thm)],[c_0_14])). 0.23/0.56 thf(c_0_17, negated_conjecture, (in @ esk2_0 @ nat), inference(split_conjunct,[status(thm)],[c_0_13])). 0.23/0.56 thf(c_0_18, negated_conjecture, (in @ esk1_0 @ nat), inference(split_conjunct,[status(thm)],[c_0_13])). 0.23/0.56 thf(c_0_19, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15, c_0_16]), c_0_17]), c_0_18])]), ['proof']). 0.23/0.56 # SZS output end CNFRefutation 0.23/0.56 # Parsed axioms : 314 0.23/0.56 # Removed by relevancy pruning/SinE : 244 0.23/0.56 # Initial clauses : 110 0.23/0.56 # Removed in clause preprocessing : 3 0.23/0.56 # Initial clauses in saturation : 107 0.23/0.56 # Processed clauses : 148 0.23/0.56 # ...of these trivial : 4 0.23/0.56 # ...subsumed : 8 0.23/0.56 # ...remaining for further processing : 136 0.23/0.56 # Other redundant clauses eliminated : 2 0.23/0.56 # Clauses deleted for lack of memory : 0 0.23/0.56 # Backward-subsumed : 0 0.23/0.56 # Backward-rewritten : 0 0.23/0.56 # Generated clauses : 21 0.23/0.56 # ...of the previous two non-redundant : 15 0.23/0.56 # ...aggressively subsumed : 0 0.23/0.56 # Contextual simplify-reflections : 0 0.23/0.56 # Paramodulations : 15 0.23/0.56 # Factorizations : 0 0.23/0.56 # NegExts : 0 0.23/0.56 # Equation resolutions : 3 0.23/0.56 # Propositional unsat checks : 0 0.23/0.56 # Propositional check models : 0 0.23/0.56 # Propositional check unsatisfiable : 0 0.23/0.56 # Propositional clauses : 0 0.23/0.56 # Propositional clauses after purity: 0 0.23/0.56 # Propositional unsat core size : 0 0.23/0.56 # Propositional preprocessing time : 0.000 0.23/0.56 # Propositional encoding time : 0.000 0.23/0.56 # Propositional solver time : 0.000 0.23/0.56 # Success case prop preproc time : 0.000 0.23/0.56 # Success case prop encoding time : 0.000 0.23/0.56 # Success case prop solver time : 0.000 0.23/0.56 # Current number of processed clauses : 39 0.23/0.56 # Positive orientable unit clauses : 18 0.23/0.56 # Positive unorientable unit clauses: 0 0.23/0.56 # Negative unit clauses : 5 0.23/0.56 # Non-unit-clauses : 16 0.23/0.56 # Current number of unprocessed clauses: 68 0.23/0.56 # ...number of literals in the above : 224 0.23/0.56 # Current number of archived formulas : 0 0.23/0.56 # Current number of archived clauses : 96 0.23/0.56 # Clause-clause subsumption calls (NU) : 698 0.23/0.56 # Rec. Clause-clause subsumption calls : 247 0.23/0.56 # Non-unit clause-clause subsumptions : 8 0.23/0.56 # Unit Clause-clause subsumption calls : 15 0.23/0.56 # Rewrite failures with RHS unbound : 0 0.23/0.56 # BW rewrite match attempts : 2 0.23/0.56 # BW rewrite match successes : 0 0.23/0.56 # Condensation attempts : 148 0.23/0.56 # Condensation successes : 0 0.23/0.56 # Termbank termtop insertions : 14864 0.23/0.56 0.23/0.56 # ------------------------------------------------- 0.23/0.56 # User time : 0.019 s 0.23/0.56 # System time : 0.010 s 0.23/0.56 # Total time : 0.029 s 0.23/0.56 # Maximum resident set size: 2992 pages 0.23/0.57 0.23/0.57 # ------------------------------------------------- 0.23/0.57 # User time : 0.028 s 0.23/0.57 # System time : 0.011 s 0.23/0.57 # Total time : 0.039 s 0.23/0.57 # Maximum resident set size: 2140 pages 0.23/0.57 EOF